The distributed Karhunen-Loeve transform
نویسندگان
چکیده
The Karhunen-Loève transform (KLT) is a key element of many signal processing and communication tasks. Many recent applications involve distributed signal processing, where it is not generally possible to apply the KLT to the entire signal; rather, the KLT must be approximated in a distributed fashion. This paper investigates such distributed approaches to the KLT, where several distributed terminals observe disjoint subsets of a random vector. We introduce several versions of the distributed KLT. First, a local KLT is introduced, which is the optimal solution for a given terminal, assuming all else is fixed. This local KLT is different and in general improves upon the marginal KLT which simply ignores other terminals. Both optimal approximation and compression using this local KLT are derived. Two important special cases are studied in detail, namely the partial observation KLT which has access to a subset of variables, but aims at reconstructing them all, and the conditional KLT which has access to side information at the decoder. We focus on the jointly Gaussian case, with known correlation structure, and on approximation and compression problems. Then, the distributed KLT is addressed by considering local KLT’s in turn at the various terminals, leading to an iterative algorithm which is locally convergent, sometimes reaching a global optimum, depending on the overall correlation structure. For compression, it is shown that the classical distributed source coding techniques admit a natural transform coding interpretation, the transform being the distributed KLT. Examples throughout illustrate the performance of the proposed distributed KLT. This distributed transform has potential applications in sensor networks, distributed image databases, hyper-spectral imagery, and data fusion.
منابع مشابه
Compression of image clusters using Karhunen Loeve transformations
This paper proposes to extend the Karhunen-Loeve compression algorithm to multiple images. The resulting algorithm is compared against single-image Karhunen Loeve as well as algorithms based on the Discrete Cosine Transformation (DCT). Futhermore, various methods for obtaining compressable clusters from large image databases are evaluated.
متن کاملGeneralized Karhunen-Loeve Transform - IEEE Signal Processing Letters
We present a novel generic tool for data compression and filtering: the generalized Karhunen–Loeve (GKL) transform. The GKL transform minimizes a distance between any given reference and a transformation of some given data where the transform has a predetermined maximum possible rank. The GKL transform is also a generalization of the relative Karhunen–Loeve (RKL) transform by Yamashita and Ogaw...
متن کاملComparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform
In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.
متن کاملClassifiers of Digital Modulation Based on the Algorithm of Fast Walsh-Hadamard Transform and Karhunen-Loeve Transform
متن کامل
The Asymptotic Noise Distribution in Karhunen-Loeve Transform Eigenmodes
Karhunen-Loeve Transform (KLT) is widely used in signal processing. Yet the well-accepted result is that, the noise is uniformly distributed in all eigenmodes is not accurate. We apply a result of the random matrix theory to understand the asymptotic noise distribution in KLT eigenmodes. Noise variances in noise-only eigenmodes follow the Marcenko-Pastur distribution, while noise variances in s...
متن کامل